Preface to Special Issue on General Secure Multi-Party Computation
نویسنده
چکیده
More than a decade has passed since general results concerning secure two-party and multi-party computations were rst announced in 15, 24, 16] (see details in 14]). In a nutshell, assuming the existence of trapdoor permutations, these results assert that one can construct protocols for securely computing any desirable multi-party functionality. These results either require a majority of honest players or allow dishonest players to suspend the execution (while being detected as bad). Subsequent \unconditional" results in the \private channel model" require a 2/3-majority of honest player (cf., 4, 7]). The abovementioned results were presented at a time in which intensive electronic multi-party interactions seemed a remote possibility. So it seems fair to say that, while generating considerable interest within the theory community, these results generated little interest in the applied cryptography community. But times have changed: Intensive electronic multi-party interactions seems almost a reality, and the entire cryptographic community seems very much interested in a variety of natural problems which arise from such a reality. This has triggered the idea of having a special issue on general secure multi-party computation. Most of the current application-oriented interest is focused on the design of eecient and secure schemes for speciic purposes { Threshold Cryptography (cf., 10, 12]) is indeed a good example. Nevertheless, we believe that the general study of secure multi-party computation is important to practice. Firstly, this study clariies fundamental issues regarding security in a multi-party environment. Secondly, it draws the lines between what is possible in principle and what is not. Thirdly, it develops general techniques for design of secure protocols. And last, sometimes, it may even yield schemes (or modules) which may be incorporated in practical systems. Thus, we believe that the current special issue may be both of theoretical and practical interest. In order to put the papers of this special issue in perspective, it seems good to start with a short overview of the area.
منابع مشابه
Secure Two-party Protocols for Point Inclusion Problem
It is well known that, in theory, the general secure multiparty computation problem is solvable using circuit evaluation protocols. However, the communication complexity of the resulting protocols depend on the size of the circuit that expresses the functionality to be computed and hence can be impractical. Hence special solutions are needed for specific problems for efficiency reasons. The poi...
متن کاملThe Exact Round Complexity of Secure Computation
We revisit the exact round complexity of secure computation in the multi-party and twoparty settings. For the special case of two-parties without a simultaneous message exchange channel, this question has been extensively studied and resolved. In particular, Katz and Ostrovsky (CRYPTO ’04) proved that five rounds are necessary and sufficient for securely realizing every two-party functionality ...
متن کاملUnconditionally Secure Multi-Party Computation
The most general type of multi-party computation involves n participants. Participant i supplies private data xi and obtains an output function fi(x1, . . . , xn). The computation is said to be unconditionally secure if each participant can verify, with probability arbitrarily close to one, that every other participant obtains arbitrarily little information beyond their agreed output fi. We giv...
متن کاملQuorum-Based Secure Multi-party Computation
This paper describes efficient protocols for multi-party computations that are information-theoretically secure against passive attacks. The results presented here apply to access structures based on quorum systems, which are collections of sets enjoying a naturallymotivated self-intersection property. Quorum-based access structures include threshold systems but are far richer and more general,...
متن کاملEfficient Multi-party Computation over Rings
Secure multi-party computation (MPC) is an active research area, and a wide range of literature can be found nowadays suggesting improvements and generalizations of existing protocols in various directions. However, all current techniques for secure MPC apply to functions that are represented by (boolean or arithmetic) circuits over finite fields. We are motivated by two limitations of these te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999